Section: New Software and Platforms

Givy

Givy is a runtime developed as part of the PhD thesis of François Gindraud. It is designed for architectures with distributed memories, with the Kalray MPPA as the main target. It executes dynamic data-flow task graphs, annotated with memory dependencies. It automatically handles scheduling and placement of tasks (using the memory dependency hints), and generate memory transfers between distributed memory nodes when needed by using a software cache coherence protocol. An important part of the work corresponds on implementing and testing a memory allocator with specific properties that is a building block of the whole run time. This memory allocator is also tuned to work on the MPPA and its constraints, turning with very little memory and being efficient in the context of multith readed calls.